Families satisfying the Haar condition

On ℤ4 codes satisfying the chain condition

Largest Induced Suborders Satisfying the Chain Condition

For a fmite ordered set P, let c(P) denote the cardinality of the largest subset Q such that the induced suborder on Q satisfies the Jordan-Dedekind chain condition (JDCC), i.e., every maximal chain in Q has the same cardinality. For positive integers n, let be the minimum of c(P) over all ordered sets P of cardinahty n. We prove: &r 1 <f(n) < 4e AhfS (MOS) subject ckwiflcation (1980). 06AO5.

Group connectivity of graphs satisfying Ore-condition

In this paper, we show that a simple graph G satisfying Ore-condition with |V (G)| ≥ 3 is A-connected if and only if G is not a 4-cycle, where A is an abelian group of order at least 4.

On Regular Rings Satisfying Weak Chain Condition

In this paper, we shall study regular rings satisfying weak chain condition. As main results, we show that regular rings satisfying weak chain condition are unit-regular, and show that these rings have the unperforation and power cancellation properties for the family of finitely generated projective modules.

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition

A digraph D is said to satisfy the k-Meyniel’s condition if each odd directed cycle of D has at least k diagonals. The study of the k-Meyniel’s condition has been a source of many interesting problems, questions and results in the development of Kernel Theory. In this paper we present a method to construct a large variety of kernel-perfect (resp. critical kernel-imperfect) digraphs which satisf...